Improved approximation algorithms for k-connected m-dominating set problems
نویسندگان
چکیده
منابع مشابه
Improved approximation algorithms for k-connected m-dominating set problems
A graph is k-connected if it has k internally-disjoint paths between every pair of nodes. A subset S of nodes in a graph G is a kconnected set if the subgraph G[S] induced by S is k-connected; S is an m-dominating set if every v ∈ V \ S has at least m neighbors in S. If S is both k-connected and m-dominating then S is a k-connected m-dominating set, or (k,m)-cds for short. In the k-Connected mD...
متن کاملAlgorithms for Minimum m -Connected k -Dominating Set Problem
In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consid...
متن کاملAlgorithms for minimum m-connected k-tuple dominating set problem
In wireless sensor networks, a virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we cons...
متن کاملApproximation Algorithm for Minimum Weight Connected m-Fold Dominating Set
Using connected dominating set (CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone has some fault-tolerance. A k-connected m-fold dominating set ((k,m)-CDS) of a graph G is a node set D such that every node in V \ D has at least m neighbor...
متن کاملPerformance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set
To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a (k,m)-CDS. For a connected graph G = (V,E) and two fixed integers k and m, a node set C ⊆ V is a (k,m)-CDS of G if every node in V \C has at least m neighbors in C, and the subgraph of G induced by C is k-connected. Previ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2018
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2018.08.003